A DISTANCE BASED INCREMENTAL FILTER-WRAPPER ALGORITHM FOR FINDING REDUCT IN INCOMPLETE DECISION TABLES
نویسندگان
چکیده
منابع مشابه
Approach to approximate distribution reduct in incomplete ordered decision system
The original rough set model cannot be used to deal with the incomplete information systems. Nevertheless, by relaxing the indiscernibility relation to more general binary relations, many improved rough set models have been successfully applied into the incomplete information systems for knowledge acquisition. This article presents an explorative research focusing on the transition from incompl...
متن کاملApproximation reduction in inconsistent incomplete decision tables
0950-7051/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.knosys.2010.02.004 * Corresponding author. Address: Key Laboratory o and Chinese, Information Processing of Ministry of China. E-mail addresses: [email protected] (Y. Qian [email protected] (D. Li), [email protected] (F. W (N. Ma). This article deals with approaches to attribute reductions in inconsistent incomplete decision tabl...
متن کاملA Multi-Threshold Granulation Model for Incomplete Decision Tables
How to establish basic granules of knowledge is a fundamental issue for data mining from incomplete decision tables. In the existing methods, basic granules under similarity relation contain too many objects and disturb the later knowledge mining, while granules under limited similarity relation, although simplifying the granules through introducing a limited threshold on two objects satisfying...
متن کاملA Fast Algorithm for Incremental Distance Calculation
A simple and efficient algorithm for finding the closest points between two convex polyhedra is described here. Data from numerous experiments tested on a broad set of convex polyhedra on !X3 show that the running time is roughly constant for finding closest points when nearest points are approximately known and is linear in total number of vertices if no special initialization is done. This al...
متن کاملAn Efficient Algorithm for Determining the Set of All Reductive Attributes in Incomplete Decision Tables
In rough set theory, the number of all reducts for a given decision table can be exponential with respect to the number of attributes. This paper investigates the problem of determining the set of all reductive attributes which are present in at least one reduct of an incomplete decision table. We theoretically prove that this problem can be solved in polynomial time. This result shows that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Vietnam Journal of Science and Technology
سال: 2019
ISSN: 2525-2518,2525-2518
DOI: 10.15625/2525-2518/57/4/13773